A Limited-diffusion Algorithm for Blind Substring Search
نویسنده
چکیده
Applications are described for " blind substring search, " where a program to search files for a substring is published without revealing the substring. The " limited diffusion " approach proposed in a previous article is described. Design criteria for a Boolean function to be used in the limited diffusion algorithm are stated, and a function meeting the criteria is proposed. An algorithm for blind substring search is developed and discussed.
منابع مشابه
Shen Substring - Searchable Symmetric Encryption
In this paper, we consider a setting where a client wants to outsource storage of a large amount of private data and then perform substring search queries on the data – given a data string s and a search string p, find all occurrences of p as a substring of s. First, we formalize an encryption paradigm that we call queryable encryption, which generalizes searchable symmetric encryption (SSE) an...
متن کاملSubstring-Searchable Symmetric Encryption
In this paper, we consider a setting where a client wants to outsource storage of a large amount of private data and then perform substring search queries on the data – given a data string s and a search string p, find all occurrences of p as a substring of s. First, we formalize an encryption paradigm that we call queryable encryption, which generalizes searchable symmetric encryption (SSE) an...
متن کاملEmily Shen Substring - Searchable Symmetric Encryption
In this paper, we consider a setting where aclient wants to outsource storage of a large amount ofprivate data and then perform substring search querieson the data – given a data string s and a search stringp, find all occurrences of p as a substring of s. First, weformalize an encryption paradigm that we call queryableencryption, which generalizes searchable symmetric e...
متن کاملand Emily Shen Substring - Searchable Symmetric Encryption
In this paper, we consider a setting where aclient wants to outsource storage of a large amount ofprivate data and then perform substring search querieson the data – given a data string s and a search stringp, find all occurrences of p as a substring of s. First, weformalize an encryption paradigm that we call queryableencryption, which generalizes searchable symmetric e...
متن کاملGravitational Search Algorithm to Solve the K-of-N Lifetime Problem in Two-Tiered WSNs
Wireless Sensor Networks (WSNs) are networks of autonomous nodes used for monitoring an environment. In designing WSNs, one of the main issues is limited energy source for each sensor node. Hence, offering ways to optimize energy consumption in WSNs which eventually increases the network lifetime is strongly felt. Gravitational Search Algorithm (GSA) is a novel stochastic population-based meta-...
متن کامل